Self-Learning Sparse PCA for Multimode Process Monitoring
نویسندگان
چکیده
This article proposes a novel sparse principal component analysis algorithm with self-learning ability for multimode process monitoring, where the successive modes are learned in sequential fashion. Different from traditional monitoring methods, small set of data collected when mode arrives. The proposed method remembers knowledge by selectively slowing down changes parameters important previous modes, importance measure is estimated synaptic intelligence. sufficient condition fault detectability proved to provide comprehensive understanding method. Besides, computation and storage resources saved long run, because it not necessary retrain model scratch frequently discarded once they have been learned. More importantly, furnishes excellent interpretability catastrophic forgetting problem further alleviated owing sparsity parameters. In addition, hyperparameters discussed understand comprehensively computational complexity analyzed. Compared several state-of-the-art approaches, numerical case, practical pulverizing system adopted illustrate effectiveness algorithm.
منابع مشابه
PCA learning for sparse high-dimensional data
– We study the performance of principal component analysis (PCA). In particular, we consider the problem of how many training pattern vectors are required to accurately represent the low-dimensional structure of the data. This problem is of particular relevance now that PCA is commonly applied to extremely high-dimensional (N 5000–30000) real data sets produced from molecular-biology research p...
متن کاملA Robust Pca Modeling Method for Process Monitoring
A robust method for dealing with the gross errors in the data collected for PCA model is proposed. This method, using M-estimator based on the generalized t distribution, adaptively transforms the data in the score space in order to eliminate the effects of the outliers in the original data. The robust estimation of the covariance or correlation matrix is obtained by the proposed approach so th...
متن کاملDeflation Methods for Sparse PCA
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and matrix deflation. While the former has received a great deal of attention in the literature, the latter is seldom analyzed and is typically borrowed without justification from the PCA context. In this work, we demonstra...
متن کاملMinimax Rates for Sparse PCA
We state below two results that we use frequently in our proofs. The first is well-known consequence of the CS decomposition. It relates the canonical angles between subspaces to the singular values of products and differences of their corresponding projection matrices.
متن کاملPenalty-free sparse PCA
A drawback of the sparse principal component analysis (PCA) procedures using penalty functions is that the number of zeros in the matrix of component loadings as a whole cannot be specified in advance. We thus propose a new sparse PCA procedure in which the least squares PCA loss function is minimized subject to a pre-specified number of zeros in the loading matrix. The procedure is called unpe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Industrial Informatics
سال: 2023
ISSN: ['1551-3203', '1941-0050']
DOI: https://doi.org/10.1109/tii.2022.3178736